Threshold Secret Sharing Transmission against Passive Eavesdropping in MIMO Wireless Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold Secret Image Sharing

A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...

متن کامل

Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters

In this paper, we consider three very important issues namely detection, identification and robustness of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase. Towards this we present five different schemes. Among these, first we present two k-out-of-n secret sharing s...

متن کامل

Multi-Threshold Visual Secret Sharing

Visual cryptography (VC) has been developed extensively based on its practicability. These schemes can encode a black-and-white secret image into several shadow images, and, by stacking a certain number of shadow images, can retrieve the secret image through the human visual system. In this paper, we employ Hsu et al.’s ideal multi-threshold secret sharing scheme based on monotone span programs...

متن کامل

On Hierarchical Threshold Secret Sharing

Recently, two novel schemes have been proposed for hierarchical threshold secret sharing, one based on Birkoff interpolation and another based on bivariate Lagrange interpolation. In this short paper, we propose a much simpler solution for this problem.

متن کامل

Repairable Threshold Secret Sharing Schemes

In this paper, we propose a class of new threshold secret sharing schemes with repairing function between shares. Specifically, each share, when it is broken or lost, can be repaired by some others without the help of the dealer. Further, a construction of such repairable threshold secret sharing schemes is designed by applying linearized polynomials and regenerating codes in distributed storag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Communications and Mobile Computing

سال: 2018

ISSN: 1530-8669,1530-8677

DOI: 10.1155/2018/4143061